An Incremental Map-Matching Algorithm Based on Hidden Markov Model

نویسندگان

  • Piotr Szwed
  • Kamil Pekala
چکیده

Map-matching algorithms aim at establishing a vehicle location on a road segment based on positioning data from a variety of sensors: GPS receivers, WiFi or cellular radios. They are integral part of various Intelligent Transportation Systems (ITS) including fleet management, vehicle tracking, navigation services, traffic monitoring and congestion detection. Our work was motivated by an idea of developing an algorithm that can be both utilized for tracking individual vehicles and for monitoring traffic in real-time. We propose a new incremental map-matching algorithm that constructs of a sequence of Hidden-Markov Models (HMMs). Starting from an initial HMM, the next models are developed by alternating operations: expansion and contraction. In the later, the map-matched trace is output. We discuss results of initial experiments conducted for 20 GPS traces, which to test algorithm robustness, were modified by introduction of noise and/or downsampled.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Map-matching in a real-time traffic monitoring

We describe a prototype implementation of a real time traffic monitoring service that uses GPS positioning information received from moving vehicles to calculate average speed and travel time and assign them to road segments. The primary factor for reliability of determined parameters is the correct calculation of a vehicle location on a road segment, which is realized by a map-matching algorit...

متن کامل

Real-Time Dense Map Matching with Naive Hidden Markov Models: Delay versus Accuracy

In this paper, an algorithm for map matching is proposed, based on a Viterbi algorithm running over a Hidden Markov Model. The algorithm performs similarly to other existing algorithms for map matching, but runs faster and forgoes the use of memory-intensive shortest path algorithms. The results for the algorithm on data collected around Palo Alto are provided, and various potential improvement...

متن کامل

Speech enhancement based on hidden Markov model using sparse code shrinkage

This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...

متن کامل

Enhanced Map-Matching Algorithm with a Hidden Markov Model for Mobile Phone Positioning

Numerous map-matching techniques have been developed to improve positioning, using Global Positioning System (GPS) data and other sensors. However, most existing map-matching algorithms process GPS data with high sampling rates, to achieve a higher correct rate and strong universality. This paper introduces a novel map-matching algorithm based on a hidden Markov model (HMM) for GPS positioning ...

متن کامل

Abnormality Detection in a Landing Operation Using Hidden Markov Model

The air transport industry is seeking to manage risks in air travels. Its main objective is to detect abnormal behaviors in various flight conditions. The current methods have some limitations and are based on studying the risks and measuring the effective parameters. These parameters do not remove the dependency of a flight process on the time and human decisions. In this paper, we used an HMM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014